A Polynomial Column-wise Rescaling von Neumann Algorithm
نویسندگان
چکیده
Recently Chubanov proposed a method which solves homogeneous linear equality systems with positive variables in polynomial time. Chubanov’s method can be considered as a column-wise rescaling procedure. We adapt Chubanov’s method to the von Neumann problem, and so we design a polynomial time column-wise rescaling von Neumann algorithm. This algorithm is the first variant of the von Neumann algorithm with polynomial complexity.
منابع مشابه
An Example with Decreasing Largest Inscribed Ball for Deterministic Rescaling Algorithms
Recently, Peña and Sohèili presented a deterministic rescaling perceptron algorithm and proved that it solves a feasible perceptron problem in O(mn log(ρ−1)) perceptron update steps, where ρ is the radius of the largest inscribed ball. The original stochastic rescaling perceptron algorithm of Dunagan and Vempala is based on systematic increase of ρ, while the proof of Peña and Sohèili is based ...
متن کاملA robust von Neumann minimax theorem for zero-sum games under bounded payoff uncertainty
The celebrated von Neumann minimax theorem is a fundamental theorem in two-person zero-sum games. In this paper, we present a generalization of the von Neumann minimax theorem, called robust von Neumann minimax theorem, in the face of data uncertainty in the payoff matrix via robust optimization approach. We establish that the robust von Neumann minimax theorem is guaranteed for various classes...
متن کاملVarious topological forms of Von Neumann regularity in Banach algebras
We study topological von Neumann regularity and principal von Neumann regularity of Banach algebras. Our main objective is comparing these two types of Banach algebras and some other known Banach algebras with one another. In particular, we show that the class of topologically von Neumann regular Banach algebras contains all $C^*$-algebras, group algebras of compact abelian groups and ...
متن کاملCalculating Different Topological Indices of Von Neumann Regular Graph of Z_(p^α )
By the Von Neumann regular graph of R, we mean the graph that its vertices are all elements of R such that there is an edge between vertices x,y if and only if x+y is a von Neumann regular element of R, denoted by G_Vnr (R). For a commutative ring R with unity, x in R is called Von Neumann regular if there exists x in R such that a=a2 x. We denote the set of Von Neumann regular elements by V nr...
متن کاملThe James and von Neumann-Jordan type constants and uniform normal structure in Banach spaces
Recently, Takahashi has introduced the James and von Neumann-Jordan type constants. In this paper, we present some sufficient conditions for uniform normal structure and therefore the fixed point property of a Banach space in terms of the James and von Neumann-Jordan type constants and the Ptolemy constant. Our main results of the paper significantly generalize and improve many known results in...
متن کامل